Maximally edge-connected and vertex-connected graphs and digraphs: A survey
نویسندگان
چکیده
منابع مشابه
Sufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملMaximally edge-connected digraphs
In this paper we present some new sufficient conditions for equality of edge-connectivity and minimum degree of graphs and digraphs as well as of bipartite graphs and digraphs.
متن کاملMaximally Connected Graphs and Digraphs
Preface Graphs are often used as a model for networks, for example transport networks, telecommunication systems, a network of servers and so on. Typically, the networks and thus the representing graphs are connected; that means, that there exists a path between all pairs of two vertices in the graph. But sometimes an element of the network fails, for the graphs that means the removal of a vert...
متن کاملmaximally edge - connected and super - edge - connected graphs ∗
Let G be a connected graph with minimum degree δ and edgeconnectivity λ. A graph is maximally edge-connected if λ = δ, and it is superedge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or sup...
متن کاملSufficient conditions for maximally edge-connected graphs and arc-connected digraphs
A connected graph with edge connectivity λ and minimum degree δ is called maximally edge-connected if λ = δ. A strongly connected digraph with arc connectivity λ and minimum degree δ is called maximally arc-connected if λ = δ. In this paper, some new sufficient conditions are presented for maximally edge-connected graphs and arc-connected digraphs. We only consider finite graphs (digraphs) with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.06.035